Answer Set Optimization
نویسندگان
چکیده
We investigate the combination of answer set programming and qualitative optimization techniques. Answer set optimization programs (ASO programs) have two parts. The generating program produces answer sets representing possible solutions. The preference program expresses user preferences. It induces a preference relation on the answer sets of based on the degree to which rules are satisfied. We discuss possible applications of ASO programming, give complexity results and propose implementation techniques. We also analyze the relationship between A SO programs and CP-networks.
منابع مشابه
Nested Aggregates in Answer Sets: An Application to a Priori Optimization
We allow representing and reasoning in the presence of nested multiple aggregates over multiple variables and nested multiple aggregates over functions involving multiple variables in answer sets, precisely, in answer set optimization programming and in answer set programming. We show the applicability of the answer set optimization programming with nested multiple aggregates and the answer set...
متن کاملLogical Fuzzy Optimization
We present a logical framework to represent and reason about fuzzy optimization problems based on fuzzy answer set optimization programming. This is accomplished by allowing fuzzy optimization aggregates, e.g., minimum and maximum in the language of fuzzy answer set optimization programming to allow minimization or maximization of some desired criteria under fuzzy environments. We show the appl...
متن کاملLogical Stochastic Optimization
We present a logical framework to represent and reason about stochastic optimization problems based on probability answer set programming [Saad and Pontelli, 2006; Saad, 2006; Saad, 2007a]. This is established by allowing probability optimization aggregates, e.g., minimum and maximum in the language of probability answer set programming to allow minimization or maximization of some desired crit...
متن کاملPreferences and Priorities in ASP
In this paper we extend our previous work concerning preferences in Answer Set Programming (ASP), and integrate this work with PDL, a wellknown approach to answer set optimization. We thus obtain a powerful language for expressing preferences in ASP.
متن کاملComplex Preferences for Answer Set Optimization
The main contribution of this paper is the definition of the preference description language . This language allows us to combine qualitative and quantitative, penalty based preferences in a flexible way. This makes it possible to express complex preferences which are needed in many realistic optimization settings. We show that several preference handling methods described in the literature are...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003